1,991 research outputs found
A kind of conditional connectivity of transposition networks generated by -trees
For a graph , a subset is called an
-vertex-cut of if is disconnected and each vertex has at least neighbors in . The -vertex-connectivity of ,
denoted by , is the cardinality of the minimum -vertex-cut of
, which is a refined measure for the fault tolerance of network . In this
paper, we study for Cayley graphs generated by -trees. Let
be the symmetric group on and be a
set of transpositions of . Let be the graph on
vertices such that there is an edge in
if and only if the transposition . The
graph is called the transposition generating graph of
. We denote by the Cayley graph
generated by . The Cayley graph is
denoted by if is a -tree. We determine
in this work. The trees are -trees, and the complete
graph on vertices is a -tree. Thus, in this sense, this work is a
generalization of the such results on Cayley graphs generated by transposition
generating trees and the complete-transposition graphs.Comment: 11pages,2figure
Parity-odd Parton Distribution Functions from -Vacuum
Quantum chromodynamics is a fundamental non-abelian gauge theory of strong
interactions. The physical quantum chromodynamics vacuum state,
, is a linear superposition of the -vacua states with
different topological numbers. Because of the configuration of the gauge
fields, the tunneling events can induce the local parity-odd domains. Those
interactions that occur in these domains can be affected by these effects.
Considering the hadron (nucleon) system, we introduce the parity-odd parton
distribution functions in order to describe the parity-odd structures inside
the hadron in this paper. We obtain 8 parity-odd parton distribution functions
at leading twist for spin-1/2 hadrons and present properties of these parton
distribution functions. By introducing the parity-odd quark-quark correlator,
we find the parity-odd effects vanish from the macroscopic point of view. Since
the parity-odd effects are confined in small domains, we consider the high
energy semi-inclusive deeply inelastic scattering process to investigate these
effects by calculating the single spin asymmetries.Comment: arXiv admin note: text overlap with arXiv:1906.0342
On the existence of specified cycles in bipartite tournaments
For two integers and , we denote the
digraph obtained from a directed -cycle by changing the orientations of
consecutive arcs. In this paper, we show that a family of -regular
bipartite tournament contains for all unless is isomorphic to a digraph such that
is a Hamilton cycle and and
, where .Comment: 15 page
Embedding 5-planar graphs in three pages
A \emph{book-embedding} of a graph is an embedding of vertices of
along the spine of a book, and edges of on the pages so that no two edges
on the same page intersect. the minimum number of pages in which a graph can be
embedded is called the \emph{page number}. The book-embedding of graphs may be
important in several technical applications, e.g., sorting with parallel
stacks, fault-tolerant processor arrays design, and layout problems with
application to very large scale integration (VLSI). Bernhart and Kainen firstly
considered the book-embedding of the planar graph and conjectured that its page
number can be made arbitrarily large [JCT, 1979, 320-331]. Heath [FOCS84] found
that planar graphs admit a seven-page book embedding. Later, Yannakakis proved
that four pages are necessary and sufficient for planar graphs in [STOC86].
Recently, Bekos et al. [STACS14] described an time algorithm of
two-page book embedding for 4-planar graphs. In this paper, we embed 5-planar
graphs into a book of three pages by an time algorithm
The Tur\'an problem for a family of tight linear forests
Let be a family of -graphs. The Tur\'an number
is defined to be the maximum number of edges in an
-graph of order that is -free. The famous Erd\H{o}s
Matching Conjecture shows that where
represents the -graph consisting of disjoint edges.
Motivated by this conjecture, we consider the Tur\'an problem for tight linear
forests. A tight linear forest is an -graph whose connected components are
all tight paths or isolated vertices. Let be the
family of all tight linear forests of order with edges in -graphs.
In this paper, we prove that for sufficiently large ,
where and if and with , if and
with . The proof is based on the weak regularity lemma for
hypergraphs. We also conjecture that for arbitrary satisfying $k \equiv 1\
(mod\ r)d$ in the above result equals 0. We prove that the
proposed conjecture implies the Erd\H{o}s Matching Conjecture directly
The Tur\'{a}n Number for Spanning Linear Forests
For a set of graphs , the extremal number is
the maximum number of edges in a graph of order not containing any subgraph
isomorphic to some graph in . If contains a graph on
vertices, then we often call the problem a spanning Tur\'{a}n problem. A
linear forest is a graph whose connected components are all paths and isolated
vertices. In this paper, we let be the set of all linear
forests of order with at least edges. We prove that when
and , Clearly,
the result is interesting when
Electronic Conduction in Short DNA Wires
A strict method is used to calculate the current-voltage characteristics of a
double-stranded DNA. A more reliable model considering the electrostatic
potential drop along an individual DNA molecular wire between the contacts is
considered and the corresponding Green's Function is obtained analytically
using Generating Function method, which avoids difficult numerical evaluations.
The obtained results indicate that the electrostatic drop along the wire always
increases the conductor beyond the threshold than without considering it, which
is in agreement with recent experiments. The present method can also be used to
calculate the current-voltage characteristics for other molecular wires of
arbitrary length.Comment: 9 pages, 2 figur
A new transformation into State Transition Algorithm for finding the global minimum
To promote the global search ability of the original state transition
algorithm, a new operator called axesion is suggested, which aims to search
along the axes and strengthen single dimensional search. Several benchmark
minimization problems are used to illustrate the advantages of the improved
algorithm over other random search methods. The results of numerical
experiments show that the new transformation can enhance the performance of the
state transition algorithm and the new strategy is effective and reliable.Comment: 5 pages, 6 figure
On the spanning connectivity of tournaments
Let be a digraph. A -container of between and , ,
is a set of internally disjoint paths between and . A -container
of is a strong (resp. weak) -container if there is a set of
internally disjoint paths with the same direction (resp. with different
directions allowed) between and and it contains all vertices of . A
digraph is -strongly (resp. -weakly) connected if there
exists a strong (resp. weak) -container between any two distinct
vertices. We define the strong (resp. weak) spanning connectivity of a digraph
, (resp. ), to be the largest
integer such that is -strongly (resp. -weakly)
connected for all if is a -strongly (resp.
-weakly) connected. In this paper, we show that a tournament with
vertices and irregularity , if , then
and if
.Comment: 11 page
On the number of proper paths between vertices in edge-colored hypercubes
Given an integer , define the -coloring of a -dimensional
hypercube to be the -coloring of the edges of in which all
edges in dimension , , have color and all other edges
have color . Cheng et al.
[Proper distance in edge-colored hypercubes, Applied Mathematics and
Computation 313 (2017) 384-391.] determined the number of distinct shortest
properly colored paths between a pair of vertices for the -colored
hypercubes. It is natural to consider the number for -coloring, .
In this note, we determine the number of different shortest proper paths in
-colored hypercubes for arbitrary .Comment: 9 page
- β¦